NpgRJ_Nm_1663 1324..1332
نویسندگان
چکیده
Hepatic injury is associated with a defective intestinal barrier and increased hepatic exposure to bacterial products. Here we report that the intestinal bacterial microflora and a functional Toll-like receptor 4 (TLR4), but not TLR2, are required for hepatic fibrogenesis. Using Tlr4-chimeric mice and in vivo lipopolysaccharide (LPS) challenge, we demonstrate that quiescent hepatic stellate cells (HSCs), the main precursors for myofibroblasts in the liver, are the predominant target through which TLR4 ligands promote fibrogenesis. In quiescent HSCs, TLR4 activation not only upregulates chemokine secretion and induces chemotaxis of Kupffer cells, but also downregulates the transforming growth factor (TGF)-b pseudoreceptor Bambi to sensitize HSCs to TGF-b– induced signals and allow for unrestricted activation by Kupffer cells. LPS-induced Bambi downregulation and sensitization to TGF-b is mediated by a MyD88–NF-jB–dependent pathway. Accordingly, Myd88-deficient mice have decreased hepatic fibrosis. Thus, modulation of TGF-b signaling by a TLR4-MyD88–NF-jB axis provides a novel link between proinflammatory and profibrogenic signals.
منابع مشابه
وضعیت امنیت راههای اصفهان در سالهای پس از مشروطه (1324 - 1332 ق/ 1906 – 1914 م)
انقلاب مشروطیت پس از بهبار نشستن، به سبب خلأ قدرت و تحت تأثیر عوامل و زمینههای اجتماعی و سیاسی، گذاری کُند و پیچیده از نظام امنیتی سابق به وضعیتی تازه را تجربه کرد و طی این دوران با ناامنی گسترده در راههای مواصلاتی کشور مواجه شد. این مقاله وضعیت پیشآمده در منطقۀ اصفهان را بررسی میکند. در این نوشتار نشان داده میشود که وضعیت راهها در اطراف اصفهان، بلافاصله پس از وقوع انقلاب مشروطه تا آستان...
متن کاملUsing functional equations to enumerate 1324-avoiding permutations
We consider the problem of enumerating permutations with exactly r occurrences of the pattern 1324 and derive functional equations for this general case as well as for the pattern avoidance (r = 0) case. The functional equations lead to a new algorithm for enumerating length n permutations that avoid 1324. This approach is used to enumerate the 1324-avoiders up to n = 31. We also extend those f...
متن کاملCounting 1324-Avoiding Permutations
We consider permutations that avoid the pattern 1324. By studying the generating tree for such permutations, we obtain a recurrence formula for their number. A computer program provides data for the number of 1324-avoiding permutations of length up to 20.
متن کاملOn permutations which are 1324 and 2143 avoiding
We consider permutations which are 1324 and 2143 avoiding, where 2143 avoiding means that it is 2143 avoiding with the additional Bruhat restriction {2 ↔ 3}. In particular, for every permutation π we will construct a linear map Lπ and a labeled graph Gπ and will show that the following three conditions are equivalent: π is 1324 and 2143 avoiding; Lπ is onto; Gπ is a forest. We will also give so...
متن کاملOn the growth rate of 1324-avoiding permutations
We give an improved algorithm for counting the number of 1324-avoiding permutations, resulting in 5 further terms of the generating function. We analyse the known coefficients and find compelling evidence that unlike other classical length-4 patternavoiding permutations, the generating function in this case does not have an algebraic singularity. Rather, the number of 1324-avoiding permutations...
متن کامل